41![Looking for Busy Beavers. A socio-philosophical study of a computer-assisted proof. Liesbeth De Mol∗ [removed] Looking for Busy Beavers. A socio-philosophical study of a computer-assisted proof. Liesbeth De Mol∗ [removed]](https://www.pdfsearch.io/img/e9905e53fe90139d08374664186cb07e.jpg) | Add to Reading ListSource URL: logica.ugent.beLanguage: English - Date: 2011-11-29 04:50:50
|
---|
42![La d´ecouverte de la calculabilit´e L. De Mol Generating, solving and the mathematics of Homo Sapiens. La d´ecouverte de la calculabilit´e L. De Mol Generating, solving and the mathematics of Homo Sapiens.](https://www.pdfsearch.io/img/26818c11a04fd1de210c6df1a722788b.jpg) | Add to Reading ListSource URL: logica.ugent.beLanguage: English - Date: 2011-11-23 05:32:01
|
---|
43![cSplash, Event for High School Students, Courant Institute What is the Numerical Halting Problem? Chee Yap Computer Science Dept, Courant, NYU Mar 29, 2008 cSplash, Event for High School Students, Courant Institute What is the Numerical Halting Problem? Chee Yap Computer Science Dept, Courant, NYU Mar 29, 2008](https://www.pdfsearch.io/img/37c5542b8bcf6de3209f7c7fc821a81d.jpg) | Add to Reading ListSource URL: cs.nyu.eduLanguage: English - Date: 2013-02-22 12:21:24
|
---|
44![Generating, solving and the mathematics of Homo Sapiens. Emil Post’s views on computation Liesbeth De Mol∗ [removed] “For if symbolic logic has failed to give wings to mathematicians this study of Generating, solving and the mathematics of Homo Sapiens. Emil Post’s views on computation Liesbeth De Mol∗ [removed] “For if symbolic logic has failed to give wings to mathematicians this study of](https://www.pdfsearch.io/img/58adfd4158f494cbbfa8822822d581bc.jpg) | Add to Reading ListSource URL: logica.ugent.beLanguage: English - Date: 2011-11-29 04:43:49
|
---|
45![arXiv:1312.4455v1 [quant-ph] 16 Dec[removed]The Universe as Quantum Computer Seth Lloyd Department of Mechanical Engineering Massachusetts Institute of Technology arXiv:1312.4455v1 [quant-ph] 16 Dec[removed]The Universe as Quantum Computer Seth Lloyd Department of Mechanical Engineering Massachusetts Institute of Technology](https://www.pdfsearch.io/img/4e7b5365c35aacbe60f51d3353da1774.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2013-12-16 20:26:09
|
---|
46![Fundamentals of Computing Leonid A. Levin These are notes for the course CS-172 I first taught in the Fall 1986 at UC Berkeley and subsequently at Boston University. The goal was to introduce the undergraduates to basic Fundamentals of Computing Leonid A. Levin These are notes for the course CS-172 I first taught in the Fall 1986 at UC Berkeley and subsequently at Boston University. The goal was to introduce the undergraduates to basic](https://www.pdfsearch.io/img/291f92bb077a5fbdb5749d9bde9e375c.jpg) | Add to Reading ListSource URL: www.cs.bu.eduLanguage: English - Date: 2015-03-30 07:56:29
|
---|
47![Two fundamental problems connected with AI Abstract This paper is about two fundamental problems in the field of computer science. Solving these two problems is important because it has to do with the creation of Artific Two fundamental problems connected with AI Abstract This paper is about two fundamental problems in the field of computer science. Solving these two problems is important because it has to do with the creation of Artific](https://www.pdfsearch.io/img/e247590f97ede80a84c4c093b1865f94.jpg) | Add to Reading ListSource URL: www.dobrev.comLanguage: English - Date: 2007-04-22 07:35:32
|
---|
48![CAN A TURING PLAYER IDENTIFY ITSELF? DAVID K. LEVINE AND AND BALÁZS SZENTES A BSTRACT. We show that the problem of whether two Turing Machines are functionally equivalent is undecidable and explain why this is significa CAN A TURING PLAYER IDENTIFY ITSELF? DAVID K. LEVINE AND AND BALÁZS SZENTES A BSTRACT. We show that the problem of whether two Turing Machines are functionally equivalent is undecidable and explain why this is significa](https://www.pdfsearch.io/img/4cea02af90fc43781c04b25348ea7d2a.jpg) | Add to Reading ListSource URL: levine.sscnet.ucla.eduLanguage: English - Date: 2006-03-16 11:03:47
|
---|
49![A MECHANICAL PROOF OF THE UNSOLVABILITY OF THE HALTING PROBLEM Robert S. Boyer and J Strother Moore ICSCA-CMP-28 July 1982 A MECHANICAL PROOF OF THE UNSOLVABILITY OF THE HALTING PROBLEM Robert S. Boyer and J Strother Moore ICSCA-CMP-28 July 1982](https://www.pdfsearch.io/img/687a10d6020708b484b0b3630bec12d6.jpg) | Add to Reading ListSource URL: www.cs.utexas.eduLanguage: English - Date: 2000-04-02 13:39:25
|
---|
50![Asia Pacific Mathematics Newsletter January[removed]Volume 2 Number 1 Asia Pacific Mathematics Newsletter January[removed]Volume 2 Number 1](https://www.pdfsearch.io/img/fb88d431a79eb61f0f770c87e4eecac5.jpg) | Add to Reading ListSource URL: www.austms.org.auLanguage: English - Date: 2012-07-31 22:40:14
|
---|